Arithmetic subtrees in large subsets of products of trees

نویسندگان

چکیده

Furstenberg-Weiss have extended Szemerédi’s theorem on arithmetic progressions to trees by showing that a large subset of the tree contains arbitrarily long subtrees. We study higher dimensional versions analogously extend multidimensional Szemerédi demonstrating existence certain structures in subsets cartesian product trees.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of subtrees of trees

Let T be a weighted tree. The weight of a subtree T1 of T is defined as the product of weights of vertices and edges of T1. We obtain a linear-time algorithm to count the sum of weights of subtrees of T . As applications, we characterize the tree with the diameter at least d, which has the maximum number of subtrees, and we characterize the tree with the maximum degree at least ∆, which has the...

متن کامل

Optimizing constrained subtrees of trees

Given a tree G = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the "rooted subtree problem", is to find a maximum weight subtree, with a specified root, from a given set of subtrees. The second problem, called "the subtree packing problem", is to find a maximum weight packing of node disjoint subtrees chosen from a given set...

متن کامل

Greedy Trees, Subtrees and Antichains

Greedy trees are constructed from a given degree sequence by a simple greedy algorithm that assigns the highest degree to the root, the second-, third-, . . . highest degrees to the root’s neighbors, and so on. They have been shown to maximize or minimize a number of different graph invariants among trees with a given degree sequence. In particular, the total number of subtrees of a tree is max...

متن کامل

Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees

This paper considers partitioning the vertices of an n-vertex tree into p disjoint sets C1, C2, . . . , Cp, called clusters so that the number of vertices in a cluster and the number of subtrees in a cluster are minimized. For this NP-hard problem we present greedy heuristics which differ in (i) how subtrees are identified (using either a best-fit, good-fit, or first-fit selection criteria), (i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal D Analyse Mathematique

سال: 2023

ISSN: ['0021-7670', '1565-8538']

DOI: https://doi.org/10.1007/s11854-023-0277-0